An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case

Let v be a vertex of a graph G. By the local complementation of G at v we mean to complement the subgraph induced by the neighbors of v. This operator can be generalized as follows. Assume that, each edge of G has a label in the finite field Fq. Let (gij) be set of labels (gij is the label of edge ij). We define two types of operators. For the first one, let v be a vertex of G and a ∈ Fq, and obtain the graph with labels g ′ ij = gij + agvigvj . For the second, if 0 6= b ∈ Fq the resulted graph is a graph with labels g ′′ vi = bgvi and g ′′ ij = gij , for i, j unequal to v. It is clear that if the field is binary, the operators are just local complementations that we described. The problem of whether two graphs are equivalent under local complementations has been studied, [3]. Here we consider the general case and assuming that q is odd, present the first known efficient algorithm to verify whether two graphs are locally equivalent or not.